|
In computer science, a container is a class, a data structure,〔Paul E. Black (ed.), entry for ''data structure'' in ''Dictionary of Algorithms and Data Structures. US National Institute of Standards and Technology.15 December 2004. Accessed on Oct 04, 2011.〕〔Entry ''data structure'' in the Encyclopædia Britannica (2009) (Online entry ) Accessed on Oct 04, 2011.〕 or an abstract data type (ADT) whose instances are collections of other objects. In other words, they store objects in an organized way that follows specific access rules. The size of the container depends on the number of objects (elements) it contains. Underlying implementation of various container types may vary in space and time complexity, which provides flexibility in choosing the right implementation for a given scenario. ==Overview== Containers can be looked at in three ways: * ''access'', that is the way of accessing the objects of the container. In the case of arrays, access is done with the array index. In the case of stacks, access is done according to the LIFO (last in, first out) order (alternative name: FILO, first in, last out)〔(LIFO(investopedia.com) )〕 and in the case of queues it is done according to the FIFO (first in, first out) order (alternative name: LILO, last in, last out);〔(FIFO(investopedia.com) )〕〔(FIFO(businessdictionary.com) )〕 * ''storage'', that is the way of storing the objects of the container; * ''traversal'', that is the way of traversing the objects of the container. Container classes are expected to implement methods to do the following: * create an empty container; * insert objects into the container; * delete objects from the container; * delete all the objects in the container (clear); * access the objects in the container; * access the number of objects in the container (size). Containers are sometimes implemented in conjunction with iterators. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Container (abstract data type)」の詳細全文を読む スポンサード リンク
|